Open Synchronous Cellular Learning Automata
نویسندگان
چکیده
Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the action of each cell in next stage of its evolution not only depends on the local environment (actions of its neighbors) but it also depends on the external environments. We call such a CLA as open cellular learning automata. In this paper, we introduce open cellular learning automata and then study its steady state behavior. It is shown that for class of rules called commutative rules, the open cellular learning automata in stationary external environments converges to a stable and compatible configuration. Then the application of this new model to image segmentation has been presented.
منابع مشابه
Improved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملAsynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...
متن کاملA Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...
متن کاملAsynchronous Automata Networks Can Emulate any Synchronous Automata Network
We show that any locally finite automata network A with global synchronous updates can be emulated by another one Â, whose structure derives from that of A by a simple construction, but whose updates are made asynchronously at its various component automata (e.g., possibly randomly or sequentially, with or without possible simultaneous updates at different nodes). By “emulatation”, we refer to ...
متن کاملLearning Automata
Received 17 Revised Cellular learning automata is a combination of learning automata and cellular automata. 19 This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning 21 automata which can interact together. In some applications such as image processing, a type of cellular learn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Advances in Complex Systems
دوره 10 شماره
صفحات -
تاریخ انتشار 2007